Coarse-grained parallel algorithms for scientific applicationsDEHNE, Frank.Algorithmica. 2006, Vol 45, Num 3, issn 0178-4617, 268 p.Serial Issue

Using spine decompositions to efficiently solve the length-constrained heaviest path problem for treesBHATTACHARYYA, Bishnu; DEHNE, Frank.Information processing letters. 2008, Vol 108, Num 5, pp 293-297, issn 0020-0190, 5 p.Article

Greedy localization, iterative compression, and modeled crown reductions: New FPT techniques, an improved algorithm for set splitting, and a novel 2k kernelization for vertex coverDEHNE, Frank; FELLOWS, Mike; ROSAMOND, Frances et al.Lecture notes in computer science. 2004, pp 271-280, issn 0302-9743, isbn 3-540-23071-8, 10 p.Conference Paper

Shortest Paths in Time-Dependent FIFO NetworksDEHNE, Frank; OMRAN, Masoud T; SACK, Jörg-Rüdiger et al.Algorithmica. 2012, Vol 62, Num 1-2, pp 416-435, issn 0178-4617, 20 p.Article

Efficient external memory algorithms by simulating coarse-grained parallel algorithmsDEHNE, Frank; DITTRICH, Wolfgang; HUTCHINSON, David et al.Algorithmica. 2003, Vol 36, Num 2, pp 97-122, issn 0178-4617, 26 p.Article

WADS 2003 : algorithms and data structures (Ottawa ON, 30 July - 1 August 2003)Dehne, Frank; Sack, Jörg-Rüdiger; Smid, Michiel et al.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40545-3, XII, 522 p, isbn 3-540-40545-3Conference Proceedings

Algorithms and data structures (Providence RI, 8-10 August 2001)Dehne, Frank; Sack, Jörg-Rüdiger; Tamassia, Roberto et al.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42423-7, XII, 484 p, isbn 3-540-42423-7Conference Proceedings

Algorithms and data structurese (Waterloo ON, 15-17 August 2005)Dehne, Frank; Lopez-Ortiz, Alejandro; Sack, Jörg-Rüdiger et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28101-0, XIV, 446 p, isbn 3-540-28101-0Conference Proceedings

Practical FPT implementations and applicationsLANGSTON, Mike.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-23071-8, p. 291Conference Paper

Parameterized and exact computation (Bergen, 14-17 September 2004)Dowsney, Rod; Fellows, Michael; Dehne, Frank et al.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-23071-8, X, 290 p, isbn 3-540-23071-8Conference Proceedings

Parameterized graph separation problemsMARX, Daniel.Lecture notes in computer science. 2004, pp 71-82, issn 0302-9743, isbn 3-540-23071-8, 12 p.Conference Paper

Parameterized coloring problems on chordal graphsMARX, Daniel.Lecture notes in computer science. 2004, pp 83-95, issn 0302-9743, isbn 3-540-23071-8, 13 p.Conference Paper

Bounded fixed-parameter tractability: The case 2^poly(k)WEYER, Mark.Lecture notes in computer science. 2004, pp 49-60, issn 0302-9743, isbn 3-540-23071-8, 12 p.Conference Paper

Parallel computation of high-dimensional robust correlation and covariance matricesCHILSON, James; NG, Raymond; WAGNER, Alan et al.Algorithmica. 2006, Vol 45, Num 3, pp 403-431, issn 0178-4617, 29 p.Article

Parallelizing feature selectionTEIXEIRA DE SOUZA, Jerffeson; MATWIN, Stan; JAPKOWICZ, Nathalie et al.Algorithmica. 2006, Vol 45, Num 3, pp 433-456, issn 0178-4617, 24 p.Article

Design and performance of a heterogeneous grid partitionerHARVEY, Daniel J; DAS, Sajal K; BISWAS, Rupak et al.Algorithmica. 2006, Vol 45, Num 3, pp 509-530, issn 0178-4617, 22 p.Article

NONBLOCKER : Parameterized algorithmics for MINIMUM DOMINATING SETDEHNE, Frank; FELLOWS, Michael; FEMAU, Henning et al.Lecture notes in computer science. 2006, pp 237-245, issn 0302-9743, isbn 3-540-31198-X, 1Vol, 9 p.Conference Paper

Maximizing a Voronoi region: The convex caseDEHNE, Frank; KLEIN, Rolf; SEIDEL, Raimund et al.Lecture notes in computer science. 2002, pp 624-634, issn 0302-9743, isbn 3-540-00142-5, 11 p.Conference Paper

A dynamic implicit adjacency labelling scheme for line graphsMORGAN, David.Lecture notes in computer science. 2005, pp 294-305, issn 0302-9743, isbn 3-540-28101-0, 12 p.Conference Paper

Space and time complexity of exact algorithms: Some open problemsWOEGINGER, Gerhard J.Lecture notes in computer science. 2004, pp 281-290, issn 0302-9743, isbn 3-540-23071-8, 10 p.Conference Paper

Complexity bounds for vertical decompositions of linear arrangements in four dimensionsKOLTUN, Vladlen.Lecture notes in computer science. 2001, pp 99-110, issn 0302-9743, isbn 3-540-42423-7Conference Paper

Line-segment intersection made in-placeVAHRENHOLD, Jan.Lecture notes in computer science. 2005, pp 146-157, issn 0302-9743, isbn 3-540-28101-0, 12 p.Conference Paper

On decidability of MSO theories of representable matroidsHLINENY, Petr; SEESE, Detlef.Lecture notes in computer science. 2004, pp 96-107, issn 0302-9743, isbn 3-540-23071-8, 12 p.Conference Paper

Algorithms and approximation schemes for minimum lateness/tardiness scheduling with rejectionSENGUPTA, Sudipta.Lecture notes in computer science. 2003, pp 79-90, issn 0302-9743, isbn 3-540-40545-3, 12 p.Conference Paper

On the Hausdorff Voronoi diagram of point clusters in the planePAPADOPOULOU, Evanthia.Lecture notes in computer science. 2003, pp 439-450, issn 0302-9743, isbn 3-540-40545-3, 12 p.Conference Paper